KSP: A Resolution-based Prover for Multimodal K, Abridged Report
نویسندگان
چکیده
We briefly describe an implementation of a hyperresolution-based calculus for the propositional basic multimodal logic, Kn. The prover, KSP, which allows for both local and global reasoning, is designed to support experimentation with different combinations of refinements for its basic calculus. We present an experimental evaluation that compares KSP with a range of existing reasoners for Kn.
منابع مشابه
KSP: A resolution-based prover for multimodal K
In this paper, we describe an implementation of a hyper-resolutionbased calculus for the propositional basic multimodal logic, Kn. The prover was designed to support experimentation with different combinations of refinements for its basic calculus: it is primarily based on the set of support strategy, which can then be combined with other refinements, simplification techniques and different cho...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملMultimodal and intuitionistic logics in simple type theory
We study straightforward embeddings of propositional normal multimodal logic and propositional intuitionistic logic in simple type theory. The correctness of these embeddings is easily shown. We give examples to demonstrate that these embeddings provide an effective framework for computational investigations of various non-classical logics. We report some experiments using the higher-order auto...
متن کاملTableaux-Based Prover for Typed Hybrid Multimodal Logic
Some potential application domains of hybrid multimodal logic suggest typing of states and imposing type–constraints on modalities. In [7] we have investigated the logical/computational cost of such an extension with a very simple system of types and concluded that there is none: both expressivity and complexity are preserved by the extension. Rewrite rules coping with state equality and state ...
متن کاملModeling different decision strategies in a time tabled multimodal route planning by integrating the quantifier-guided OWA operators, fuzzy AHP weighting method and TOPSIS
The purpose of Multi-modal Multi-criteria Personalized Route Planning (MMPRP) is to provide an optimal route between an origin-destination pair by considering weights of effective criteria in a way this route can be a combination of public and private modes of transportation. In this paper, the fuzzy analytical hierarchy process (fuzzy AHP) and the quantifier-guided ordered weighted averaging (...
متن کامل